A WAM-based implementation for Composition of Logic Programs
نویسندگان
چکیده
The main aim of this paper is to show an abstract machine for compiling logic programs composed by means of meta-operators; in particular, we deal with union, intersection and closure, which are directly supported by the most common abstract machine for logic programming: the Warren Abstract Machine. The proposed solution is a mix of the interpretation-oriented and the compilation-oriented approach such that it is possible to exploit the beneets and to reduce, as possible, the drawbacks.
منابع مشابه
An Abstract Machine for Fixed-order Dynamically Stratiied Programs
It is known that a xed computation rule, such as used in most logic programming systems, does not suuce for normal logic programs. For instance, SLS resolution, which evaluates programs according to the well-founded semantics, makes use of an oracle to determine the next literal to select in 5], and of ideal parallelism in 8]. Given these limits, it is natural to deene a subclass of normal prog...
متن کاملFormal Design of an Abstract Machine for Constraint Logic Programming
By studying properties of CLP over an unspecified constraint domain X one obtains general results applicable to all instances of CLP(X ). The purpose of this paper is to study a general implementation scheme for CLP(X ) by designing a generic extension WAM(X ) of the WAM and a corresponding generic compilation scheme of CLP(X ) programs to WAM(X ) code which is based on Börger and Rosenzweig’s ...
متن کاملA WAM Implementation for the Logic Meta Programming Language 'Log
A technique for compiling the meta-programming logic programming language 'Log (read quote log) is presented and the extensions to the standard Warren Abstract Machine (WAM) architecture necessary to support the execution of 'Log programs are described. 'Log is a logic programming language upgraded with a flexible naming scheme and a set of operators allowing each syntactic entity to be referre...
متن کاملEeciently Implementing Slg Resolution
SLG is a table-oriented resolution method that is gaining increasing attention due to its ability to combine the deductive database, non-monotonic reasoning and logic programming paradigms. SLG resembles SLD in that it admits a tuple-at-a-time resolution method, so it can make use of many of the techniques developed in implementing SLD over the past decade. Indeed, a program can contain any mix...
متن کاملAnalysis of SLG-WAM Evaluation of Definite Programs
SLG is a table-oriented resolution method that combines the deduc-tive database and logic programming paradigms. SLG is applicable to de-ductive databases since it terminates and has polynomial data complexity for programs with nite models. In terms of the logic programming (and non-monotonic) paradigms, SLG computes the well-founded model for non-stratiied programs, and has been extended to co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007